Branch and bound - PDFSEARCH.IO - Document Search Engine

Branch and bound
Results: 97

#	Item
71	Practical Global Optimization for Multiview Geometry Sameer Agarwal1 , Manmohan Krishna Chandraker1 , Fredrik Kahl2 , David Kriegman1 , and Serge Belongie1 1 Add to Reading List Source URL: vision.ucsd.edu Language: English - Date: 2006-10-27 15:32:17 Convex analysis Linear algebra Operations research Combinatorial optimization Convex optimization Convex function Branch and bound Quadratic programming Norm Mathematical optimization Mathematics Mathematical analysis
72	Covering Number for Efficient Heuristic-Based POMDP Planning Zongzhang Zhang ZHANGZZ @ COMP. NUS . EDU . SG David Hsu DYHSU @ COMP. NUS . EDU . SG Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-02-16 19:30:21 Dynamic programming Partially observable Markov decision process Stochastic control Branch and bound NP-complete problems Statistics Mathematics Theoretical computer science
73	RULE 10 OF THE RULES OF PRACTICE FOR THE SECOND JUDICIAL DISTRICT COURT OF THE STATE OF NEVADA Rule 10. Form of pleadings. 1. All pleadings and papers presented for filing must be flat, unfolded, firmly bound Add to Reading List Source URL: www.washoecourts.com Language: English - Date: 2008-03-25 18:39:52 Legal documents Legal procedure Judicial branch of the United States government Pleading Motion Filing Summons Summary Service of process Law Civil procedure Legal terms
74	Chapter 8 OSS in Action: The Mediterranean and European Theaters In war it is the results that count, and the saboteurs and guerrilla leaders in Special Operations and the Operational Groups, the spies in Secret Intellig Add to Reading List Source URL: www.nps.gov Language: English - Date: 2008-12-03 10:58:24 Irving Goff William J. Donovan Military X-2 Counter Espionage Branch Honor Bound series Military personnel Office of Strategic Services World War II
75	Potential-based bounded-cost search and Anytime Non-Parametric A* Add to Reading List Source URL: ieor.berkeley.edu Language: English - Date: 2014-05-28 11:56:44 Graph theory Admissible heuristic Uniform-cost search Heuristic function Beam search Motion planning Branch and bound Local search Hill climbing Search algorithms Mathematics Applied mathematics
76	C OUENNE COIN-OR C OUENNE (Convex Over and Under Envelopes for Nonlinear Estimation) is an open-source solver for nonconvex mixed-integer nonlinear programming (MINLPs). The code has been developed originally in a cooper Add to Reading List Source URL: www.gams.com Language: English - Date: 2014-09-02 04:00:18 Mathematical analysis Linear programming COIN-OR SCIP Heuristic function Branch point Branch and bound Rounding MPS Operations research Mathematical optimization Mathematics
77	B ONMIN and B ONMIN H COIN-OR B ONMIN (Basic Open-source Nonlinear Mixed Integer programming) is an open-source solver for mixed-integer nonlinear programming (MINLPs). The code has been developed as part of a collaborat Add to Reading List Source URL: www.gams.com Language: English - Date: 2014-09-02 04:00:18 Combinatorial optimization Numerical analysis Linear programming Cutting-plane method Branch and bound COIN-OR Logarithm Relaxation Branch and cut Mathematical optimization Operations research Mathematics
78	An Algorithm for the Generalized Quadratic Assignment Problem Peter M. Hahn1 Electrical and Systems Engineering, University of Pennsylvania Philadelphia, PA[removed], USA [removed] Bum-Jin Kim Add to Reading List Source URL: datamininglab.com Language: English Applied mathematics Combinatorial optimization Operations research Convex optimization Semidefinite programming Generalized assignment problem Branch and bound Assignment problem Matrix Mathematical optimization Mathematics Linear programming
79	LQR-RRT∗ : Optimal Sampling-Based Motion Planning with Automatically Derived Extension Heuristics Alejandro Perez, Robert Platt Jr., George Konidaris, Leslie Kaelbling and Tomas Lozano-Perez Computer Science and Artifi Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-06-11 20:18:04 Operations research Mathematical optimization Optimal control Combinatorial optimization Robot control Heuristic function Kalman filter Dynamic programming Branch and bound Control theory Systems theory Mathematics
80	LQR-RRT∗ : Optimal Sampling-Based Motion Planning with Automatically Derived Extension Heuristics Alejandro Perez, Robert Platt Jr., George Konidaris, Leslie Kaelbling and Tomas Lozano-Perez Computer Science and Artifi Add to Reading List Source URL: lis.csail.mit.edu Language: English - Date: 2012-06-08 19:42:52 Operations research Mathematical optimization Optimal control Combinatorial optimization Robot control Heuristic function Kalman filter Dynamic programming Branch and bound Control theory Systems theory Mathematics

UPDATE